Improved integer programming bounds using intersections of corner polyhedra
نویسندگان
چکیده
Consider the relaxation of an integer programming (IP) problem in which the feasible region is replaced by the intersection of the linear programming (LP) feasible region and the corner polyhedron for a particular LP basis. Recently a primal-dual ascent algorithm has been given for solving this relaxation. Given an optimal solution of this relaxation, we state criteria for selecting a new LP basis for which the associated relaxation is stronger. These criteria may be successively applied to obtain either an optimal IP solution or a lower bound on the cost of such a solution. Conditions are given for equality of the convex hull of feasible IP solutions and the intersection of all corner polyhedra.
منابع مشابه
Grr Obner Bases of Lattices, Corner Polyhedra, and Integer Programming
There are very close connections between the arithmetic of integer lattices, algebraic properties of the associated ideals, and the geometry and the combinatorics of corresponding polyhedra. In this paper we investigate the generating sets (\Grr obner bases") of integer lattices that correspond to the Grr obner bases of the associated binomial ideals. Extending results by Sturmfels & Thomas, we...
متن کاملOrigin and early evolution of corner polyhedra
Corner Polyhedra are a natural intermediate step between linear programming and integer programming. This paper first describes how the concept of Corner Polyhedra arose unexpectedly from a practical operations research problem, and then describes how it evolved to shed light on fundamental aspects of integer programming and to provide a great variety of cutting planes for integer programming. ...
متن کاملThe Structure of the Infinite Models in Integer Programming
The infinite models in integer programming can be described as the convex hull of some points or as the intersection of half-spaces derived from valid functions. In this paper we study the relationships between these two descriptions. Our results have implications for finite dimensional corner polyhedra. One consequence is that nonnegative continuous functions suffice to describe finite dimensi...
متن کاملExtended formulations for Gomory Corner polyhedra
We present several types of extended formulations for integer programs, based on irreducible integer solutions to Gomory’s group relaxations. We present an algorithm based on an iterative reformulation technique using these extended formulations. We give computational results for benchmark problems, which illustrate the primal and dual effect of the reformulation.
متن کاملRandomized Complexity of Linear Arrangements and Polyhedra
We survey some of the recent results on the complexity of recognizing n{dimensional linear arrangements and convex polyhedra by randomized algebraic decision trees. We give also a number of concrete applications of these results. In particular, we derive rst nontrivial, in fact quadratic, randomized lower bounds on the problems like Knapsack and Bounded Integer Programming. We formulate further...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 8 شماره
صفحات -
تاریخ انتشار 1975